Decision Sum-Product-Max Networks
نویسندگان
چکیده
Sum-Product Networks (SPNs) were recently proposed as a new class of probabilistic graphical models that guarantee tractable inference, even on models with high-treewidth. In this paper, we propose a new extension to SPNs, called Decision Sum-Product-Max Networks (Decision-SPMNs), that makes SPNs suitable for discrete multi-stage decision problems. We present an algorithm that solves Decision-SPMNs in a time that is linear in the size of the network. We also present algorithms to learn the parameters of the network from data.
منابع مشابه
Sum-Product-Max Networks for Tractable Decision Making
Investigations into probabilistic graphical models for decision making have predominantly centered on influence diagrams (IDs) and decision circuits (DCs) for representation and computation of decision rules that maximize expected utility. Since IDs are typically handcrafted and DCs are compiled from IDs, in this paper we propose an approach to learn the structure and parameters of decision-mak...
متن کاملSum-Product-Max Networks for Tractable Decision Making
Investigations into probabilistic graphical models for decision making have predominantly centered on influence diagrams (IDs) and decision circuits (DCs) for representation and computation of decision rules that maximize expected utility. Since IDs are typically handcrafted and DCs are compiled from IDs, in this paper we propose an approach to learn the structure and parameters of decision-mak...
متن کاملDirectly Learning Tractable Models for Sequential Inference and DecisionMaking
Probabilistic graphical models such as Bayesian networks and Markov networks provide a general framework to represent multivariate distributions while exploiting conditional independence. Over the years, many approaches have been proposed to learn the structure of those networks Heckerman et al. (1995); Neapolitan (2004). However, even if the resulting network is small, inference may be intract...
متن کاملApproximation Complexity of Maximum A Posteriori Inference in Sum-Product Networks
We discuss the computational complexity of approximating maximum a posteriori inference in sum-product networks. We first show NP-hardness in trees of height two by a reduction from maximum independent set; this implies non-approximability within a sublinear factor. We show that this is a tight bound, as we can find an approximation within a linear factor in networks of height two. We then show...
متن کاملOn the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs
Graphical models, such as Bayesian networks and Markov random elds, represent statistical dependencies of variables by a graph. The max-product \belief propagation" algorithm is a local-message passing algorithm on this graph that is known to converge to a unique xed point when the graph is a tree. Furthermore, when the graph is a tree, the assignment based on the xed-point yields the most prob...
متن کامل